A New Hybrid Inexact Logarithmic-Quadratic Proximal Method for Nonlinear Complementarity Problems
نویسندگان
چکیده
In this paper, the authors present and analyze a new hybrid inexact Logarithmic-Quadratic Proximal method for solving nonlinear complementarity problems. Each iteration of the new method consists of a prediction and a correction step. The predictor is produced using an inexact Logarithmic-Quadratic Proximal method, which is then corrected by the Proximal Point Algorithm. The new iterate is obtained by combining predictor and correction point at each iteration. In this paper, the authors prove the convergence of the new method under the mild assumptions that the function involved is continuous and monotone. Comparison to another existing method with numerical experiments on classical NCP instances demonstrates its superiority. DOI: 10.4018/978-1-4666-0933-4.ch009
منابع مشابه
An inexact alternating direction method with SQP regularization for the structured variational inequalities
In this paper, we propose an inexact alternating direction method with square quadratic proximal (SQP) regularization for the structured variational inequalities. The predictor is obtained via solving SQP system approximately under significantly relaxed accuracy criterion and the new iterate is computed directly by an explicit formula derived from the original SQP method. Under appropriat...
متن کاملAngewandten Mathematik An Inexact QP - based Method for Nonlinear Complementarity Problems
We consider a quadratic programming-based method for nonlinear complementarity problems which allows inexact solutions of the quadratic subproblems. The main features of this method are that all iterates stay in the feasible set and that the method has some strong global and local convergence properties. Numerical results for all complementarity problems from the MCPLIB test problem collection ...
متن کاملAn inexactQP-based method for nonlinear complementarity problems
We consider a quadratic programming-based method for nonlinear complementarity problems which allows inexact solutions of the quadratic subproblems. The main features of this method are that all iterates stay in the feasible set and that the method has some strong global and local convergence properties. Numerical results for all complementarity problems from the MCPLIB test problem collection ...
متن کاملA Novel Inexact Smoothing Method for Second-Order Cone Complementarity Problems
A novel inexact smoothing method is presented for solving the second-order cone complementarity problems (SOCCP). Our method reformulates the SOCCP as an equivalent nonlinear system of equations by introducing a regularized Chen-Harker-Kanzow-Smale smoothing function. At each iteration, Newton’s method is adopted to solve the system of equations approximately, which saves computation work compa...
متن کاملInterior Point Methods for Optimal Control of Discrete-time Systems
We show that recently developed interior point methods for quadratic programming and linear complementarity problems can be put to use in solving discrete-time optimal control problems, with general pointwise constraints on states and controls. We describe interior point algorithms for a discrete time linear-quadratic regulator problem with mixed state/control constraints, and show how it can b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJORIS
دوره 1 شماره
صفحات -
تاریخ انتشار 2010